yard crane scheduling in port container terminals using genetic algorithm

نویسندگان

h javanshir

s.r seyedalizadeh ganji

چکیده

yard crane is an important resource in container terminals. efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. this paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is nphard in nature. in other words, one of the most important constraints in this model which we can mention to yard crane non- interference constraint is that they usually move on the same rails in the yard block. optimization methods, like branch and bound algorithm, has no sufficient efficiency to solve this model and become perfectly useless when the problem size increases. in this situation, using an advanced search method like genetic algorithm (ga) may be suitable. in this paper, a ga is proposed to obtain near optimal solutions. the ga is run by matlab 7.0 and the researchers used lingo software which benefits from the branch and bound algorithm for comparing outputs of ga and the exact solution. we should consider the abilities of the lingo software which is not capable of solving the problems larger than 5 slots to 3 yard cranes. the computational results show that the proposed ga is effective and efficient in solving the considered yard crane scheduling problem.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Yard crane scheduling in port container terminals using genetic algorithm

Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...

متن کامل

A new approach for constraining failure probability of a critical deteriorating system Yard crane scheduling in port container terminals using genetic algorithm

In this paper, we focus on a continuously deteriorating critical equipment which its failure cannot be measured by cost criterion. For these types of systems like military systems, nuclear systems, etc it is extremely important to avoid failure during the actual operation of the system. In this paper we propose an approach which constrains failure probability to a pre-specified value. This valu...

متن کامل

a new approach for constraining failure probability of a critical deteriorating system yard crane scheduling in port container terminals using genetic algorithm

in this paper, we focus on a continuously deteriorating critical equipment which its failure cannot be measured by cost criterion. for these types of systems like military systems, nuclear systems, etc it is extremely important to avoid failure during the actual operation of the system. in this paper we propose an approach which constrains failure probability to a pre-specified value. this valu...

متن کامل

Scheduling in Container Terminals using Network Simplex Algorithm

In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

متن کامل

An Approximation Algorithm for Quay Crane Scheduling with Non- interference Constraints in Port Container Terminals

Nowadays competition between port container terminals, especially between geographically close ones, is rapidly increasing. How to improve the competitiveness of port container terminals is, therefore, an immediate challenge, with which port operators are confronted. In terms of port competitiveness, the makespan of a container vessel, which is the latest completion time among all handling task...

متن کامل

The simultaneous reshuffle and yard crane scheduling problem in container terminals

This paper studies the simultaneous reshuffle and yard crane scheduling problem in the yard of container terminals, which is one of the key logistics problems affecting the operation efficiency in container terminals. Although the reshuffle scheduling problem has received many research attention due to its importance, the problem without considering yard crane is not very practical, which is be...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of industrial engineering, international

ISSN 1735-5702

دوره 6

شماره 11 2010

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023